Geometric Model Checking of Continuous Space
نویسندگان
چکیده
Topological Spatial Model Checking is a recent paradigm where model checking techniques are developed for the topological interpretation of Modal Logic. The Logic Closure Spaces, SLCS, extends with reachability connectives that, in turn, can be used expressing interesting spatial properties, such as "being near to" or surrounded by". SLCS constitutes kernel solid logical framework reasoning about discrete space, graphs and digital images, interpreted quasi closure spaces. Following recently geometric semantics Logic, we propose an continuous admitting procedure, by resorting to models based on polyhedra. Such representations space increasingly relevant many domains application, due developments 3D scanning visualisation that exploit mesh processing. We introduce PolyLogicA, checker formulas polyhedra demonstrate feasibility our approach two polyhedral realistic size. Finally, definition bisimilarity, proving it characterises equivalence.
منابع مشابه
investigating the feasibility of a proposed model for geometric design of deployable arch structures
deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...
FO Model Checking of Geometric Graphs
Over the past two decades the main focus of research into first-order (FO) model checking algorithms has been on sparse relational structures – culminating in the FPT algorithm by Grohe, Kreutzer and Siebertz for FO model checking of nowhere dense classes of graphs. On contrary to that, except the case of locally bounded clique-width only little is currently known about FO model checking of den...
متن کاملSpace-Efficient Bounded Model Checking
Current algorithms for bounded model checking use SAT methods for checking satisfiability of Boolean formulae. Methods based on the validity of Quantified Boolean Formulae (QBF) allow an exponentially more succinct representation of formulae to be checked, because no “unrolling” of the transition relation is required. These methods have not been widely used, because of the lack of an efficient ...
متن کاملModel Checking Semi � Continuous Time Models Using
The veri cation of timed systems is extremely important but also extremely di cult Several methods have been proposed to assist in this task including extensions to symbolic model checking One possible use of model checking to analyze timed systems is by modeling passage of time as the number of taken transitions and ap plying quantitative algorithms to determine the timing parameters of the sy...
متن کاملA geometric model of defensive peripersonal space
Potentially harmful stimuli occurring within the defensive peripersonal space (DPPS), a protective area surrounding the body, elicit stronger defensive reactions. The spatial features of the DPPS are poorly defined and limited to descriptive estimates of its extent along a single dimension. Here we postulated a family of geometric models of the DPPS, to address two important questions with resp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2022
ISSN: ['1860-5974']
DOI: https://doi.org/10.46298/lmcs-18(4:7)2022